Metastability-containing circuits, parallel distance problems, and terrain guarding
نویسنده
چکیده
“Don’t quote me on that!”
منابع مشابه
Survey of Terrain Guarding and Art Gallery Problems
The terrain guarding problem and art gallery problem are two areas in computational geometry. Different versions of terrain guarding involve guarding a discrete set of points or a continuous set of points on a terrain. The art gallery problem has versions including guarding an entire polygon by a set of discrete points at the vertices or any point inside the polygon itself. This paper will give...
متن کاملEfficient parallel implementations of approximation algorithms for guarding 1.5D terrains
In the 1.5D terrain guarding problem, an x-monotone polygonal line is defined by k vertices and a G set of terrain points, i.e. guards, and a N set of terrain points which guards are to observe (guard). This involves a weighted version of the guarding problem where guards G have weights. The goal is to determine a minimum weight subset of G to cover all the points in N , including a version whe...
متن کاملExact Algorithms for Terrain Guarding
Given a 1.5-dimensional terrain T , also known as an x-monotone polygonal chain, the Terrain Guarding problem seeks a set of points of minimum size on T that guards all of the points on T . Here, we say that a point p guards a point q if no point of the line segment pq is strictly below T . The Terrain Guarding problem has been extensively studied for over 20 years. In 2005 it was already estab...
متن کاملApproximation algorithms for terrain guarding
We present approximation algorithms and heuristics for several variations of terrain guarding problems, where we need to guard a terrain in its entirety by a minimum number of guards. Terrain guarding has applications in telecommunications, namely in the setting up of antenna networks for wireless communication. Our approximation algorithms transform the terrain guarding instance into a MINIMUM...
متن کاملAltitude Terrain Guarding and Guarding Uni-Monotone Polygons
We show that the problem of guarding an x-monotone terrain from an altitude line and the problem of guarding a uni-monotone polygon are equivalent. We present a polynomial time algorithm for both problems, and show that the cardinality of a minimum guard set and the cardinality of a maximum witness set coincide. Thus, uni-monotone polygons are perfect; this result also extends to monotone mount...
متن کامل